Parallel Asynchronous Connected Components in a Mesh
نویسندگان
چکیده
Levialdl [6J introduced a parallel synchronous algorithm for counting the number of connected components in a binary image embedded in an n X n mesh of processors that runs in time O(n). We describe a parallel asynchronous algorithm for the same problem achieving the same time bound. ·Research done while visiting the International Computer Science Institute, Berkeley, California, research supported in part by ONR under contracts N00014-84-K-0502 and NOOOl4-86~K-0689, and by NSF under Grant MIP-87-15652. tOn leave of absence from the University of Toronto, research partially supported by NSERC operating grant A8092.
منابع مشابه
Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer
We consider the problem of labeling connected components in a gray-scale image so that every component is connected, the maximum difference in the gray-scale values of the pixels within any component does not exceed a given value, and no component can be merged with a neighboring component. We develop two asymptotically optimal 0(n) time algorithms for generating such labelings on a mesh-connec...
متن کاملConnected components algorithms for mesh-connected parallel computers
We present a new CREW PRAM algorithm for nding connected components. For a graphG with n vertices andm edges, algorithmA0 requires at mostO(logn) parallel steps and performsO((n+m) logn) work in the worst case. The advantage our algorithm has over others in the literature is that it can be adapted to a 2-D mesh-connected communication model in which all CREW operations are replaced byO(logn) pa...
متن کاملGraph Embedding in the Associative Mesh Model
The Associative Mesh Model is a new parallel computing model whose basic data movements consist of global operations on data distributed on arbitrary connected components of processing nodes. The graph that de nes these connected components is a dynamically de ned subgraph of the physical interconnection graph, that is a 2 dimensional mesh with diagonals. We study in this paper the usefulness o...
متن کاملAlgorithm TOMS-2006-0003: Parallel 2D Constrained Delaunay Mesh Generation
Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present an algorithm and a software for the parallel constrained Delaunay mesh generation in two dimensions. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel. The parallel algorithm ...
متن کاملComputing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks
This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least once message delivery semantics in time O(n) using at most 4m messages of length O(lg n). The algorithm does not assume a FIFO rule for message delivery. Previously known algorithms either use longer messages or need more time. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 38 شماره
صفحات -
تاریخ انتشار 1991